Swapped interconnection networks: Topological, performance, and robustness attributes
نویسنده
چکیده
Interconnection architectures range from complete networks, that have a diameter of D= 1 but are impractical except when the number n of nodes is small, to low-cost, minimally connected ring networks whose diameter D = n/2 is unacceptable for large n. In this paper, our focus is on swapped interconnection networks that allow systematic construction of large, scalable, modular, and robust parallel architectures, while maintaining many desirable attributes of the underlying basis network comprising its clusters. A two-level swapped network with n2 nodes is built of n copies of an n-node basis network using a simple rule for intercluster connectivity (node j in cluster i connected to node i in cluster j ) that ensures its regularity, modularity, packageability, fault tolerance, and algorithmic efficiency. We show how key parameters of a swapped interconnection network are related to the corresponding parameters of its basis network and discuss implications of these results to synthesizing large networks with desirable topological, performance, and robustness attributes. In particular, we prove that a swapped network is Hamiltonian (respectively, Hamiltonian-connected) if its basis network is Hamiltonian (Hamiltonian-connected). These general results supersede a number of published results for specific basis networks and obviate the need for proving Hamiltonicity or Hamiltonian connectivity for many other basis networks of practical interest. © 2005 Elsevier Inc. All rights reserved.
منابع مشابه
Some Properties of Swapped Interconnection Networks
Interconnection architectures range from complete networks, that have a diameter of D = 1 but are impractical except when the number n of nodes is small, to low-cost, minimally connected ring or loop networks whose diameter D = n/2 is unacceptable for large n. In this paper, our focus is on swapped interconnection networks that allow systematic construction of large, scalable, and highly modu...
متن کاملBiswapped networks: a family of interconnection architectures with advantages over swapped or OTIS networks
In this paper, we propose a new family of communication architectures, called “biswapped networks” (BSNs). Each BSN is built of 2n copies of some n-node basis network using a simple rule for connectivity that ensures its regularity, modularity, fault tolerance, and algorithmic efficiency. In particular, if the basis network is a Cayley digraph then so is the resulting BSN. Our biswapped connect...
متن کاملPerformance Analysis of a New Neural Network for Routing in Mesh Interconnection Networks
Routing is one of the basic parts of a message passing multiprocessor system. The routing procedure has a great impact on the efficiency of a system. Neural algorithms that are currently in use for computer networks require a large number of neurons. If a specific topology of a multiprocessor network is considered, the number of neurons can be reduced. In this paper a new recurrent neural ne...
متن کاملPerformance Analysis of a New Neural Network for Routing in Mesh Interconnection Networks
Routing is one of the basic parts of a message passing multiprocessor system. The routing procedure has a great impact on the efficiency of a system. Neural algorithms that are currently in use for computer networks require a large number of neurons. If a specific topology of a multiprocessor network is considered, the number of neurons can be reduced. In this paper a new recurrent neural ne...
متن کاملEffects of Interdependence Characteristics on the Robustness of Interconnected Networks
Modern real networks contain many complex topological features such as clustering, hub nodes or interlayer connections that cannot be simply described using simple random networks. Previous works in this area are mainly focused on random and scale-free networks, while the effects of clustering and the nature of interconnection links on network percolation are relatively unexplored. In this pape...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Parallel Distrib. Comput.
دوره 65 شماره
صفحات -
تاریخ انتشار 2005